Separation Logic and Program Analysis
نویسنده
چکیده
ion Rules I Q ∗ lseg(E , x ′) ∗ lseg(x ′, nil) → Q ∗ lseg(E , nil) I side condition: x ′ not free in Q. I side condition for precision, not soundness: stops abstraction when x ′ is shared. x 7→x ′ ∗ lseg(E , x ′) ∗ lseg(x ′, nil) 6→ Q ∗ lseg(E , nil)
منابع مشابه
A Local Shape Analysis Based on Separation Logic : Detailed Presentation and Soundness Proof
Shape analysis is a static analysis of the source code of a program to determine shapes and manipulations of the dynamically allocated data structures at each point which that program can reach in an execution. In this report, we give a detailed presentation and soundness proof of a shape analysis method which uses separation logic to represent program memory. A Local Shape Analysis Based on Se...
متن کاملA Local Shape Analysis Based on Separation Logic
We describe a program analysis for linked list programs where the abstract domain uses formulae from separation logic.
متن کاملA Proof-Directed Parallelization Synthesis by Separation Logic
We present an analysis which takes as its input a sequential program, augmented with annotations indicating potential parallelization opportunities, and a sequential proof, written in separation logic, and produces a correctly-synchronized parallelized program and proof of that program. Unlike previous work, ours is not a simple independence analysis that admits parallelization only when thread...
متن کاملThe Effects of Modalities in Separation Logics (Extended Abstract)
Like modal logic, temporal logic, or description logic, separation logic has become a popular class of logical formalisms in computer science, conceived as assertion languages for Hoare-style proof systems with the goal to perform automatic program analysis. We present similarities with modal and temporal logics, and we present landmark results about decidability, complexity and expressive power.
متن کاملThe Effects of Modalities in Separation Logics
Like modal logic, temporal logic, or description logic, separation logic has become a popular class of logical formalisms in computer science, conceived as assertion languages for Hoare-style proof systems with the goal to perform automatic program analysis. We present similarities with modal and temporal logics, and we present landmark results about decidability, complexity and expressive power.
متن کاملAbstraction Refinement for Separation Logic Program Analyses
ion Refinement for Separation Logic Program Analyses Matko Botinčan, Mike Dodds, and Stephen Magill 1 University of Cambridge, {matko.botincan,mike.dodds}@cl.cam.ac.uk 2 [email protected] Abstract. Abstract domains based on separation logic allow the compositional analysis of heap-manipulating programs, and their effectiveness on real-world software has been extensively demonstrated. Tra...
متن کامل